Formalising Confluence in PVS
نویسنده
چکیده
Confluence is a critical property of computational systems which is related with determinism and non ambiguity and thus with other relevant computational attributes of functional specifications and rewriting system as termination and completion. Several criteria have been explored that guarantee confluence and their formalisations provide further interesting information. This work discusses topics and presents personal positions and views related with the formalisation of confluence properties in the Prototype Verification System PVS developed at our research group.
منابع مشابه
Formalising Eiffel References and Expanded Types in PVS
Ongoing work is described in which a theory of Eiffel reference and expanded (composite) types is formalised. The theory is expressed in the PVS specification language, thus enabling the use of the PVS theorem prover and model checker to semi-automatically prove properties about Eiffel structures and programs. The theory is being used as the basis for automated support for the Eiffel Refinement...
متن کاملA Theory for Abstract Reduction Systems in PVS
A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others....
متن کاملA PVS Theory for Term Rewriting Systems
A theory, called trs, for Term Rewriting Systems in the theorem Prover PVS is described. This theory is built on the PVS libraries for finite sequences and sets and a previously developed PVS theory named ars for Abstract Reduction Systems which was built on the PVS libraries for sets. Theories for dealing with the structure of terms, for replacements and substitutions jointly with ars allow fo...
متن کاملFormalizing the Confluence of Orthogonal Rewriting Systems
Orthogonality is a discipline of programming that in a syntactic manner guarantees determinism of functional specifications. Essentially, orthogonality avoids, on the one side, the inherent ambiguity of non determinism, prohibiting the existence of different rules that specify the same function and that may apply simultaneously (non-ambiguity), and, on the other side, it eliminates the possibil...
متن کاملImpact of the Confluence Angle on Flow Field and Flowmeter Accuracy in Open Channel Junctions
Open channel junction is one of the most common hydraulic structures that are used in various practical situations such as sewer, drainage, and flood control systems. Knowing the fluid flow behavior, is one of the most important topics in designing the efficient open channel junctions. The complexity and deviation of flow in the junction’s zone disrupts the proper functioning of the flowmeter d...
متن کامل